Optimal Transport Over a Linear Dynamical System

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CONTROL OF CHAOS IN A DRIVEN NON LINEAR DYNAMICAL SYSTEM

We present a numerical study of a one-dimensional version of the Burridge-Knopoff model [16] of N-site chain of spring-blocks with stick-slip dynamics. Our numerical analysis and computer simulations lead to a set of different results corresponding to different boundary conditions. It is shown that we can convert a chaotic behaviour system to a highly ordered and periodic behaviour by making on...

متن کامل

control of chaos in a driven non linear dynamical system

we present a numerical study of a one-dimensional version of the burridge-knopoff model [16] of n-site chain of spring-blocks with stick-slip dynamics. our numerical analysis and computer simulations lead to a set of different results corresponding to different boundary conditions. it is shown that we can convert a chaotic behaviour system to a highly ordered and periodic behaviour by making on...

متن کامل

Optimal Mass Transport over Bridges

We present an overview of our recent work on implementable solutions to the Schrödinger bridge problem and their potential application to optimal transport and various generalizations.

متن کامل

Optimal Linear Codes over Z

We examine the main linear coding theory problem and study the structure of optimal linear codes over the ring Zm. We derive bounds on the maximum Hamming weight of these codes. We give bounds on the best linear codes over Z8 and Z9 of lengths up to 6. We determine the minimum distances of optimal linear codes over Z4 for lengths up to 7. Some examples of optimal codes are given.

متن کامل

A Linear Dynamical System Model for Text

Low dimensional representations of words allow accurate NLP models to be trained on limited annotated data. While most representations ignore words’ local context, a natural way to induce context-dependent representations is to perform inference in a probabilistic latent-variable sequence model. Given the recent success of continuous vector space word representations, we provide such an inferen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Automatic Control

سال: 2017

ISSN: 0018-9286,1558-2523

DOI: 10.1109/tac.2016.2602103